Explicit merit factor formulae for Fekete and Turyn polynomials
نویسندگان
چکیده
منابع مشابه
Explicit formulae for Kerov polynomials
We prove two formulae expressing the Kerov polynomial Σk as a weighted sum over the set of noncrossing partitions of the set {1, . . . , k + 1}. We also give a combinatorial description of a family of symmetric functions specializing in the coefficients of Σk .
متن کاملExplicit Formulae for Some Kazhdan-Lusztig R-Polynomials
We consider the Kazhdan-Lusztig polynomials Pu,v(q) indexed by permutations u, v having particular forms with regard to their monotonicity patterns. The main results are the following. First we obtain a simplified recurrence relation satisfied by Pu,v(q) when the maximum value of v ∈ Sn occurs in position n − 2 or n − 1. As a corollary we obtain the explicit expression for Pe,3 4 ... n 1 2(q) (...
متن کاملRecurrences and explicit formulae for the expansion and connection coefficients in series of the product of two classical discrete orthogonal polynomials
Suppose that for an arbitrary function $f(x,y)$ of two discrete variables, we have the formal expansions. [f(x,y)=sumlimits_{m,n=0}^{infty }a_{m,n},P_{m}(x)P_{n}(y),] $$ x^{m}P_{j}(x)=sumlimits_{n=0}^{2m}a_{m,,n}(j)P_{j+m-n}(x),$$ we find the coefficients $b_{i,j}^{(p,q,ell ,,r)}$ in the expansion $$ x^{ell }y^{r},nabla _{x}^{p}nabla _{y}^{q},f(x,y)=x^{ell }y^{r}f^{(p,q)}(x,y) =sumli...
متن کاملFekete Polynomials and Shapes of Julia Sets
We prove that a nonempty, proper subset S of the complex plane can be approximated in a strong sense by polynomial filled Julia sets if and only if S is bounded and Ĉ \ int(S) is connected. The proof that such a set is approximable by filled Julia sets is constructive and relies on Fekete polynomials. Illustrative examples are presented. We also prove an estimate for the rate of approximation i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2001
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-01-02859-8